The WALRAS Algorithm : A Convergent Distributed Implementation of GeneralEquilibrium
نویسندگان
چکیده
The walras algorithm calculates competitive equilibria via a distributed tatonnement-like process, in which agents submit single-good demand functions to market-clearing auctions. The algorithm is asynchronous and decentralized with respect to both agents and markets, making it suitable for distributed implementation. We present a formal description of this algorithm, and prove that it converges under the standard assumption of gross substitutability. We relate our results to the literature on general equilibrium stability and some more recent work on decentralized algorithms. We present some experimental results as well, particularly for cases where the assumptions required to guarantee convergence do not hold. Finally, we consider some extensions and generalizations to the walras algorithm. 1. Distributed Implementation of General Equilibria 1.1. Tatonnement When a collection of interconnected markets achieves a perfect balance of supply and demand with respect to the maximizing behaviors of self-interested economic agents, we say that the economy is in general equilibrium. This idea of a general price equilibrium was originally articulated by L eon Walras (1874), who proposed that such equilibria could be realized through a price-adjustment process he called tatonnement (sometimes translated as \groping", or \tentative proceedings"), in which agents (that is, consumers and producers) respond to price signals for the individual goods. The agents' interactions are coordinated by a central \auction-eer" who adjusts the general price levels toward a general balance, announcing interim prices to elicit responses from the agents. More speciically, Walras envisioned the market clearing process working as follows. 1 Starting with a set of prices arbitrarily given, the excess demand in each market may be positive, zero, or negative. For an arbitrary ordering of these markets , take the rst and adjust the price so that supply and demand are equal, given all other prices. Of course, the change in the rst price will normally change Department of Economics. 1 See Lesson 12 of the original source (Walras 1874), or, for a more accessible exposition, Arrow and Hahn's account (1971, Chapter 1).
منابع مشابه
The WALRAS Algorithm: A Convergent Distributed Implementation of General Equilibrium Outcomes
The WALRAS algorithm calculates competitive equilibria via a distributed tatonnementlike process, in which agents submit single-good demand functions to market-clearing auctions. The algorithm is asynchronous and decentralized with respect to both agents and markets, making it suitable for distributed implementation. We present a formal description of this algorithm, and prove that it converges...
متن کاملA Robust Distributed Estimation Algorithm under Alpha-Stable Noise Condition
Robust adaptive estimation of unknown parameter has been an important issue in recent years for reliable operation in the distributed networks. The conventional adaptive estimation algorithms that rely on mean square error (MSE) criterion exhibit good performance in the presence of Gaussian noise, but their performance drastically decreases under impulsive noise. In this paper, we propose a rob...
متن کاملA Quadratically Convergent Interior-Point Algorithm for the P*(κ)-Matrix Horizontal Linear Complementarity Problem
In this paper, we present a new path-following interior-point algorithm for -horizontal linear complementarity problems (HLCPs). The algorithm uses only full-Newton steps which has the advantage that no line searchs are needed. Moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely, , which is as good as the linear analogue.
متن کاملOptimizing Teleportation Cost in Multi-Partition Distributed Quantum Circuits
There are many obstacles in quantum circuits implementation with large scales, so distributed quantum systems are appropriate solution for these quantum circuits. Therefore, reducing the number of quantum teleportation leads to improve the cost of implementing a quantum circuit. The minimum number of teleportations can be considered as a measure of the efficiency of distributed quantum systems....
متن کاملMethodological Shortcomings in Classical Mathematical Economics: A Critical Examination of the Contributions of Cournot, Jevons and Walras
This paper examines critically the contributions of Cournot, Jevons and Walras as the founders of classical mathematical economics from a methodological standpoint. Advances in different economic schools and doctrines in the 19th century produced an environment of multi-dimensionality in economic analysis which was regarded by the pioneers of classical mathematical economists as a chaotic state...
متن کامل